翻訳と辞書 Words near each other ・ Overnight Sensation (Hit Record) ・ Overnight Sensation (song) ・ Overnight Sensational ・ Overnight Success ・ Overnight Success (Dave Dobbyn album) ・ Overnight Success (Neil Sedaka album) ・ Overnight Success (song) ・ Overlander Falls ・ Overlander Roadhouse ・ Overlanders ・ Overlanders, Edmonton ・ Overlanding ・ Overlangbroek ・ Overlap ・ Overlap (railway signalling) ・ Overlap (term rewriting) ・ Overlap coefficient ・ Overlap extension polymerase chain reaction ・ Overlap syndrome ・ Overlap zone ・ Overlapped I/O ・ Overlapping consensus ・ Overlapping distribution method ・ Overlapping gene ・ Overlapping generations ・ Overlapping generations model ・ Overlapping interval topology ・ Overlapping markup ・ Overlapping subproblems ・ Overlap–add method Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Overlap (term rewriting) ： ウィキペディア英語版 Overlap (term rewriting) In mathematics, computer science and logic, overlap, as a property of the reduction rules in term rewriting system, describes a situation where a number of different reduction rules specify potentially contradictory ways of reducing a reducible expression (or ''redex'') within a term. More precisely, if a number of different reduction rules share function symbols on the left hand side, overlap can occur. Often we do not consider trivial overlap with a redex and itself. For example, consider the term rewriting system defined by the reduction rules : $\backslash rho\_1\backslash \; :\backslash \; f(g(x),\; y)\; \backslash rightarrow\; y$ : $\backslash rho\_2\backslash \; :\backslash \; g(x)\; \backslash rightarrow\; f(x,\; x)$ The term ''f''(''g''(''x''), ''y'') can be reduced via ρ1 to yield ''y'', but it can also be reduced via ρ2 to yield ''f''(''f''(''x'', ''x''), ''y''). Note how the redex ''g''(''x'') is contained in the redex ''f''(''g''(''x''), ''y''). The result of reducing different redexes is described in a ''critical pair''—the critical pair arising out of this term rewriting system is (''f''(''f''(''x'', ''x''), ''y''), ''y''). Overlap may occur with fewer than two reduction rules. Consider the term rewriting system defined by the reduction rule : $\backslash rho\_1\backslash \; :\backslash \; g(g(x))\; \backslash rightarrow\; x$ The term ''g''(''g''(''g''(''x''))) has overlapping redexes, which can be either applied to the innermost occurrence or to the outermost occurrence of the ''g''(''g''(''x'')) term. ==References== * 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Overlap (term rewriting)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.